Rekeying and Storage Cost for Multiple User Revocation
نویسندگان
چکیده
In this paper, we focus on tradeoffs between storage cost and rekeying cost for secure multicast. Specifically, we present a family of algorithms that provide a tradeoff between the number of keys maintained by users and the time required for rekeying due to revocation of multiple users. We show that some well known algorithms in the literature are members of this family. We show that algorithms in this family can be used to reduce the cost of rekeying by 43%−79% when compared with previous solutions while keeping the number of keys manageable. We also describe a scheme that allows one to reduce the number of keys further without increasing the rekeying cost.
منابع مشابه
An Optimized Secure Communication Using VLR-GS-BU on Wireless Network
A novel protocol to achieve privacy-preserving universal authentication protocol for wireless communications called Priauth. to secure the communication as the data are sensitive or it requires the users to pay for it. In the algorithms for secure communication a key is shared by H with V and V with users. The key is used to encrypt data transmitted to the servers or users. In privacy based aut...
متن کاملRecommendations in Using Group Key Management Algorithms
Scalable group key management (also known as group rekeying) schemes proposed in the literature can be classified into three categories: stateful schemes, stateless schemes and self-healing schemes. These schemes differ mainly on the interdependency of rekey messages and rekeying overhead. Logical key hierarchy (LKH) based approaches are stateful in that members should have received past rekeyi...
متن کاملOn Dynamic Subset Difference Revocation Scheme
Subset Difference Revocation (SDR) [7] has been proposed to perform group rekeying in a stateless manner. However, statelessness comes at a cost in terms of key storage and messaging overhead when the number of currently active members is much smaller than the number of potential group members [3]. In this paper, we propose a dynamic SDR scheme to address these two problems. Briefly, rather tha...
متن کاملPerformance Comparison of Stateful and Stateless Group Rekeying Algorithms
Scalable group rekeying schemes proposed in the literature can be classified into three categories: stateful schemes, stateless schemes and self-healing schemes. They differ mainly on the interdependency of rekey messages and messaging overhead in rekeying. Logical key hierarchy (LKH) based approaches are stateful in that members should have received past rekeying messages to decrypt current re...
متن کاملAuthentic Data Access Scheme for Variant Disruption- Tolerant Networks
Mobile nodes in military environments such as a battlefield or a hostile region are likely to suffer from intermittent network connectivity and frequent partitions. Disruption-tolerant network (DTN) technologies are becoming successful solutions that allow wireless devices carried by soldiers to communicate with each other and access the confidential information or command reliably by exploitin...
متن کامل